Consensus-Based Auctions for Decentralized Task Assignment

نویسندگان

  • Luc Brunet
  • David L. Darmofal
چکیده

This thesis addresses the decentralized task assignment problem in cooperative autonomous search and track missions by presenting the Consensus-Based class of assignment algorithms. These algorithm make use of information consensus routines to converge on the assignment rather than the situational awareness of the fleet. A market-based approach is used as the mechanism for task selection, while the novel consensus stage of the algorithms allow for fast distributed conflict resolution. Three separate algorithms belonging to the Consensus-Based class of assignment strategies will be presented. The first is the Consensus-Based Auction Algorithm (CBAA), which is a single assignment auction strategy that is shown to be bounded within 50% of the optimal solution, while an upper-bound on convergence is presented. Two multi-assignment algorithms are then presented as extensions of the CBAA. The iterative CBAA executes the single assignment algorithm multiple times in order to build an assignment with multiple tasks. The second algorithm is the more general Consensus-Based Bundle Algorithm (CBBA) in which agents build a candidate bundle of tasks and bid on each task individually based on the improvement in score achieved by adding it to the bundle. Both algorithms are shown to be lower bounded by 50% optimality, while convergence bounds are derived based on the network topology. Numerical results show that the bundle algorithm performs much better than the iterative approach while providing faster convergence times. It is also compared with the Prim Allocation (PA) auction algorithm where it is shown to exhibit much faster convergence times and give better assignments. The CBBA is also implemented in the CSAT simulation test-bed developed by Aurora Flight Sciences in conjunction with MIT, and shown to produce faster response times and better tracking performance than the currently used RDTA algorithm. Thesis Supervisor: Jonathan P. How Title: Professor

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consensus-Based Decentralized Auctions for Robust Task Allocation Citation

This paper addresses task allocation to coordinate a fleet of autonomous vehicles by presenting two decentralized algorithms: the consensus-based auction algorithm (CBAA) and its generalization to the multi-assignment problem, i.e., the consensus-based bundle algorithm (CBBA). These algorithms utilize a market-based decision strategy as the mechanism for decentralized task selection and use a c...

متن کامل

Consensus-Based Auction Approaches for Decentralized Task Assignment

This paper addresses task assignment in the coordination of a fleet of unmanned vehicles by presenting two decentralized algorithms: consensus-based auction algorithm (CBAA) and its generalization to the multi-assignment problem, consensus-based bundle algorithm (CBBA). These algorithms utilize a market-based decision strategy as the mechanism for decentralized task selection, and use a consens...

متن کامل

Robust and Decentralized Task Assignment Algorithms for UAVs

This thesis investigates the problem of decentralized task assignment for a fleet of UAVs. The main objectives of this work are to improve the robustness to noise and uncertainties in the environment and improve the scalability of standard centralized planning systems, which are typically not practical for large teams. The main contributions of the thesis are in three areas related to distribut...

متن کامل

Decentralized dynamic task planning for heterogeneous robotic networks

In this paper, we propose a decentralized model and control framework for the assignment and execution of tasks, i.e. the dynamic task planning, for a network of heterogeneous robots. The proposed modeling framework allows the design of missions, defined as sets of tasks, in order to achieve global objectives regardless of the actual characteristics of the robotic network. The concept of skills...

متن کامل

Decentralized Planning for Autonomous Agents Cooperating in Complex Missions

Planning for autonomous vehicles remains an important and challenging research topic. This thesis focuses on decentralized planning for autonomous agents performing complex missions. These types of missions often involve a set of tasks, each representing a component of the mission. Task planning algorithms may be used as part of the mission planner to assign agents to tasks; however, the decent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008